On the arithmetic Walsh coefficients of Boolean functions
نویسندگان
چکیده
We generalize to the arithmetic Walsh transform (AWT) some results which were previously known for the Walsh Hadamard transform of Boolean functions. We first generalize the classical Poisson summation formula to the AWT. We then define a generalized notion of resilience with respect to an arbitrary statistical measure of Boolean functions. We apply the Poisson summation formula to obtain a condition equivalent to resilience for one such statistical measure. Last, we show that the AWT of a large class of Boolean functions can be expressed in terms of the AWT of a Boolean function of algebraic degree at most 3 in a larger number of variables.
منابع مشابه
Taylor Expansion of Logic Functions: From Conventional to Nanoscale Design
The paper revisits the well-known spectral transforms of a Boolean function, emphasizing on the fact that ReedMuller, arithmetic and Walsh spectra can be calculated through boolean difference, and arithmetical and Walsh analogs of it. This techniques is called Taylor technique, by analogy with Taylor series which coefficients are differences, or differentials. The algorithms are perfectly imple...
متن کاملArithmetic Walsh Transform of Boolean Functions with Linear Structures
Arithmetic Walsh transform(AWT) of Boolean function caught our attention due to their arithmetic analogs of Walsh-Hadamard transform(WHT) recently. We present new results on AWT in this paper. Firstly we characterize the existence of linear structure of Boolean functions in terms of AWT. Secondly we show that the relation between AWT and WHT of a balanced Boolean function with a linear structur...
متن کاملWalsh Coefficients Distribution
The correlation of a Boolean functions with its spectral coefficients is closely related to the some cryptosystems and applications in engineering and computer sciences. By analysis of Boolean functions can be investigated whether a given function belongs to some standard class (linear, non-linear self-dual, threshold etc.) functions. For n variable Boolean function the number of nonzero spectr...
متن کاملApplications of Multi-Terminal Binary Decision Diagrams
Functions that map boolean vectors into the integers are important for the design and verification of arithmetic circuits. MTBDDs and BMDs have been proposed for representing this class of functions. We discuss the relationship between these methods and describe a generalization called hybrid decision diagrams which is often much more concise. The Walsh transform and Reed-Muller transform have ...
متن کاملYet another algorithm to compute the nonlinearity of a Boolean function
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and computing its evaluation vector requires a worst-case complexity of O(n2n) integer operations. This way, with a different approach, we reach the same complex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 73 شماره
صفحات -
تاریخ انتشار 2014